The inverse k-max combinatorial optimization problem

Classical combinatorial optimization concerns finding a feasible subset of ground set in order to optimize an objective function. We address this article the inverse problem with k-max In other words, we attempt perturb weights elements at minimum total cost make predetermined optimal fashion respect perturbed weights. first show that is general NP-hard. Regarding case independent subsets, O(n2 log n) time algorithm developed, where n number E. Special cases improved complexity are also discussed.